Complex Valued Probability Logics
نویسندگان
چکیده
We present two complex valued probabilistic logics, LCOMPB and LCOMPS , which extend classical propositional logic. In LCOMPB one can express formulas of the form Bz,ρα meaning that the probability of α is in the complex ball with the center z and the radius ρ, while in LCOMPS one can make statements of the form Sz,ρα with the intended meaning – the probability of propositional formula α is in the complex square with the center z and the side 2ρ. The corresponding strongly complete axiom systems are provided. Decidability of the logics are proved by reducing the satisfiability problem for LCOMPB (LCOMPS) to the problem of solving systems of quadratic (linear) inequalities.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملn-Valued Refined Neutrosophic Logic and Its Applications to Physics
In this paper we present a short history of logics: from particular cases of 2-symbol or numerical valued logic to the general case of n-symbol or numerical valued logic. We show generalizations of 2-valued Boolean logic to fuzzy logic, also from the Kleene’s and Lukasiewicz’ 3-symbol valued logics or Belnap’s 4-symbol valued logic to the most general n-symbol or numerical valued refined neutro...
متن کاملTowards an algebraic framework for many-valued conditional probability
We investigate probability functions defined over many valued conditional events. During the last decade or so considerable research effort has been directed towards the understanding of what (subjective) conditional probability might look like in the context of many-valued logics. Given its centrality in the area, a particularly well-studied case is that of Lukasiewicz’s infinite-valued logic ...
متن کاملModalities and many-valued: modelling uncertainty measures and similarity-based reasoning and application to Fuzzy description Logics
The talk will began remembering results on papers [22, 15, 16] where the authors model uncertainty measures as fuzzy modalities on a many-valued residuated logics. the basic idea is that uncertainty measures is not a truth degree but could be interpreted as a truth degree of the fuzzy sentence ”the probability of φ”. The main properties being that the language does not allow nested modalities a...
متن کاملInfinitely Valued Gödel Semantics for Expressive Description Logics
Fuzzy Description Logics (FDLs) combine classical Description Logics with the semantics of Fuzzy Logics in order to represent and reason with vague knowledge. Most FDLs using truth values from the interval [0, 1] have been shown to be undecidable in the presence of a negation constructor and general concept inclusions. One exception are those FDLs whose semantics is based on the infinitely valu...
متن کامل